Rough Sets Similarity-Based Learning from Databases
نویسندگان
چکیده
Many data mining algorithms developed recently are based on inductive learning methods. Very few are based on similarity-based learning. However, similarity-based learning accrues advantages, such as simple representations for concept descriptions, low incremental learning costs, small storage requirements, etc. We present a similarity-based learning method from databases in the context of rough set theory. Unlike the previous similarity-based learning methods, which only consider the syntactic distance between instances and treat all attributes equally important in the similarity measure, our method can analyse the attribute in the databases by using rough set theory and identify the relevant attributes to the task attributes. We also eliminate superfluous attributes for the task attribute and assign a weight to the relevant attributes according to their significance to the task attributes. Our similarity measure takes into account the semantic information embedded in the databases.
منابع مشابه
Logic-Based Roughification
The current chapter is devoted to roughification. In the most general setting, we intend the term roughification to refer to methods/techniques of constructing equivalence/similarity relations adequate for Pawlak-like approximations. Such techniques are fundamental in rough set theory. We propose and investigate novel roughification techniques. We show that using the proposed techniques one can...
متن کاملTOPOLOGICAL SIMILARITY OF L-RELATIONS
$L$-fuzzy rough sets are extensions of the classical rough sets by relaxing theequivalence relations to $L$-relations. The topological structures induced by$L$-fuzzy rough sets have opened up the way for applications of topological factsand methods in granular computing. In this paper, we firstly prove thateach arbitrary $L$-relation can generate an Alexandrov $L$-topology.Based on this fact, w...
متن کاملMining Temporal Patterns in Time-series Medical Databases: A Hybrid Approach of Multiscale Matching and Rough Clustering
This paper presents a method for analyzing time-series laboratory examination databases. The key concept of this method is classification of temporal patterns using multiscale structure matching and a rough set-based clustering method. Multiscale matching enables us to capture similarity between two sequences of examinations from both short-term and long-term points of view. The rough-set based...
متن کاملDistributed Incremental Data Mining from Very Large Databases: A Rough Multiset Approach
This paper presents a mechanism for developing distributed learners for learning production rules from massive, dynamic, and distributed databases. The task of distributed learning is formulated by the concept of multiset decision tables that is based on rough multisets and information multisystems, which are derived from the theory of rough sets. We use the concept of partition of boundary set...
متن کاملLearning Rules from Very Large Databases Using Rough Multisets
This paper presents a mechanism called LERS-M for learning production rules from very large databases. It can be implemented using objectrelational database systems, it can be used for distributed data mining, and it has a structure that matches well with parallel processing. LERS-M is based on rough multisets and it is formulated using relational operations with the objective to be tightly cou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995